A Berth Allocation Problem in the Public Berth System by Genetic Algorithm with Multiple Solution Candidates
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Dynamic Berth Allocation Problem with Discrete Layout
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...
متن کاملA Genetic Algorithm for Berth Allocation and Quay Crane Assignment
Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...
متن کاملOptimizing the Berth Allocation Problem using a Genetic Algorithm and Particle Swarm Optimization
Large costs arise at a seaport container terminal from the duration of the unloading of vessels and from the time a vessel is waiting to be unloaded. The optimal allocation of vessels to berth space (Berth Allocation Problem) becomes more and more important as its solution is also input to further terminal decision problems. We compare solutions for a realistic data Berth Allocation Problem fou...
متن کاملA Biased Random-Key Genetic Algorithm for the Berth Allocation and Quay Crane Assignment Problem
Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pro...
متن کاملWorking Paper The berth allocation problem with mobile quay walls
The berth allocation problem (BAP), which de nes a processing interval and a berth at the quay wall for each ship to be (un-)loaded, is an essential decision problem for e ciently operating a container port. In this paper we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled oating platforms, which encase ships moored at the immobile quay and provide additional quay ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFRASTRUCTURE PLANNING REVIEW
سال: 1999
ISSN: 0913-4034,1884-8303
DOI: 10.2208/journalip.16.827